implementing tail

См. также в других словарях:

• Tail recursion — In computer science, tail recursion (or tail end recursion) is a special case of recursion in which the last operation of the function is a recursive call. Such recursions can be easily transformed to iterations. Replacing recursion with… …   Wikipedia

• Megamax C — was a K R implementation of C for the Atari ST, Apple IIGS (APW C) and Macintosh computers. The package included a one pass compiler, resource construction kit and documentation. It allowed 68000 assembly language to be mixed with the C code. It… …   Wikipedia

• Scala (programming language) — Infobox programming language name = Scala paradigm = Multi paradigm: functional, object oriented year = 2003 designer = Martin Odersky developer = Programming Methods Laboratory of EPFL latest release version = 2.7.1 latest release date = May 5,… …   Wikipedia

• Emacs Lisp — is a dialect of the Lisp programming language used by the GNU Emacs and XEmacs text editors (which will be collectively referred to as Emacs in this article.) It is used for implementing most of the editing functionality built into Emacs, the… …   Wikipedia

• logistics — /loh jis tiks, leuh /, n. (used with a sing. or pl. v.) 1. the branch of military science and operations dealing with the procurement, supply, and maintenance of equipment, with the movement, evacuation, and hospitalization of personnel, with the …   Universalium

• Western pleasure — is a western style competition at horse shows that exhibits the manners and suitability of the horse for appropriate gait cadence and speed, along with suitable disposition. Most light horse breeds in the United States and Canada may compete in… …   Wikipedia

• Convair B-36 — B 36 redirects here. For other meanings, see B36 (disambiguation). B 36 Peacemaker The B 36D used both piston and jet engines …   Wikipedia

• goto — This article is about the programming statement. For other uses, see Goto (disambiguation). goto is a statement found in many computer programming languages. It is a combination of the English words go and to. It performs a one way transfer of… …   Wikipedia

• Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… …   Wikipedia

• Differential amplifier — symbol The inverting and non inverting inputs are distinguished by − and + symbols (respectively) placed in the amplifier triangle. Vs+ and Vs− are the power supply voltages; they are often omitted from the diagram for simplicity, but of course… …   Wikipedia

• Ciphertext stealing — In cryptography, ciphertext stealing (CTS) is a general method of using a block cipher mode of operation that allows for processing of messages that are not evenly divisible into blocks without resulting in any expansion of the ciphertext, at the …   Wikipedia